The Rewriting Calculus as a Combinatory Reduction System
Identifieur interne : 004B67 ( Main/Exploration ); précédent : 004B66; suivant : 004B68The Rewriting Calculus as a Combinatory Reduction System
Auteurs : Clara Bertolissi [France] ; Claude Kirchner [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
English descriptors
- mix :
Abstract
Abstract: The last few years have seen the development of the rewriting calculus (also called rho-calculus or ρ-calculus) that uniformly integrates first-order term rewriting and λ-calculus. The combination of these two latter formalisms has been already handled either by enriching first-order rewriting with higher-order capabilities, like in the Combinatory Reduction Systems (CRS), or by adding to λ-calculus algebraic features. In a previous work, the authors showed how the semantics of CRS can be expressed in terms of the ρ-calculus. The converse issue is adressed here: rewriting calculus derivations are simulated by Combinatory Reduction Systems derivations. As a consequence of this result, important properties, like standardisation, are deduced for the rewriting calculus.
Url:
DOI: 10.1007/978-3-540-71389-0_7
Affiliations:
- France
- Grand Est, Lorraine (région), Provence-Alpes-Côte d'Azur
- Marseille, Nancy
- Université de Provence
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000C97
- to stream Istex, to step Curation: 000C89
- to stream Istex, to step Checkpoint: 000F52
- to stream Hal, to step Corpus: 004B76
- to stream Hal, to step Curation: 004B76
- to stream Hal, to step Checkpoint: 003B26
- to stream Main, to step Merge: 004D01
- to stream Main, to step Curation: 004B67
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">The Rewriting Calculus as a Combinatory Reduction System</title><author><name sortKey="Bertolissi, Clara" sort="Bertolissi, Clara" uniqKey="Bertolissi C" first="Clara" last="Bertolissi">Clara Bertolissi</name></author><author><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:3711957443C68A621AD2C39C216C1FAD51246EBB</idno><date when="2007" year="2007">2007</date><idno type="doi">10.1007/978-3-540-71389-0_7</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-47MK9K0Z-K/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">000C97</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000C97</idno><idno type="wicri:Area/Istex/Curation">000C89</idno><idno type="wicri:Area/Istex/Checkpoint">000F52</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000F52</idno><idno type="wicri:doubleKey">0302-9743:2007:Bertolissi C:the:rewriting:calculus</idno><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:inria-00121792</idno><idno type="url">https://hal.inria.fr/inria-00121792</idno><idno type="wicri:Area/Hal/Corpus">004B76</idno><idno type="wicri:Area/Hal/Curation">004B76</idno><idno type="wicri:Area/Hal/Checkpoint">003B26</idno><idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">003B26</idno><idno type="wicri:Area/Main/Merge">004D01</idno><idno type="wicri:Area/Main/Curation">004B67</idno><idno type="wicri:Area/Main/Exploration">004B67</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">The Rewriting Calculus as a Combinatory Reduction System</title><author><name sortKey="Bertolissi, Clara" sort="Bertolissi, Clara" uniqKey="Bertolissi C" first="Clara" last="Bertolissi">Clara Bertolissi</name><affiliation wicri:level="4"><country xml:lang="fr">France</country><wicri:regionArea>LIF-CMI, Université de Provence, Marseille</wicri:regionArea><placeName><region type="region">Provence-Alpes-Côte d'Azur</region><region type="old region">Provence-Alpes-Côte d'Azur</region><settlement type="city">Marseille</settlement></placeName><orgName type="university">Université de Provence</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>INRIA & LORIA, Nancy</wicri:regionArea><placeName><region type="region">Grand Est</region><region type="old region">Lorraine (région)</region><settlement type="city">Nancy</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><title level="s" type="abbrev">LNCS</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>CRS</term><term>rewriting calculus</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The last few years have seen the development of the rewriting calculus (also called rho-calculus or ρ-calculus) that uniformly integrates first-order term rewriting and λ-calculus. The combination of these two latter formalisms has been already handled either by enriching first-order rewriting with higher-order capabilities, like in the Combinatory Reduction Systems (CRS), or by adding to λ-calculus algebraic features. In a previous work, the authors showed how the semantics of CRS can be expressed in terms of the ρ-calculus. The converse issue is adressed here: rewriting calculus derivations are simulated by Combinatory Reduction Systems derivations. As a consequence of this result, important properties, like standardisation, are deduced for the rewriting calculus.</div></front></TEI><affiliations><list><country><li>France</li></country><region><li>Grand Est</li><li>Lorraine (région)</li><li>Provence-Alpes-Côte d'Azur</li></region><settlement><li>Marseille</li><li>Nancy</li></settlement><orgName><li>Université de Provence</li></orgName></list><tree><country name="France"><region name="Provence-Alpes-Côte d'Azur"><name sortKey="Bertolissi, Clara" sort="Bertolissi, Clara" uniqKey="Bertolissi C" first="Clara" last="Bertolissi">Clara Bertolissi</name></region><name sortKey="Bertolissi, Clara" sort="Bertolissi, Clara" uniqKey="Bertolissi C" first="Clara" last="Bertolissi">Clara Bertolissi</name><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 004B67 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 004B67 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:3711957443C68A621AD2C39C216C1FAD51246EBB
|texte= The Rewriting Calculus as a Combinatory Reduction System
}}
| This area was generated with Dilib version V0.6.33. |  |